Mobile agent group communication ensuring reliability and totally-ordered delivery

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mobile agent group communication ensuring reliability and totally-ordered delivery

In this paper, an atomic mobile agent group communication protocol is designed to have the following beneficial features. The protocol enables each agent to adaptively choose a small number of forwarders among its visiting nodes based on its decision. Also, it replicates paths on which messages should be transmitted to their targeting mobile agents in an effective manner. The mobile agent group...

متن کامل

Totally Ordered Commutative Semigroups

Let 5( + , < ) be a system consisting of a set S endowed with an associative binary operation + and a total ( = linear = simple) order relation < . The composition + and the relation < may be connected by either or both of the following conditions. MC (Monotone Condition). If a and b are elements of 5 such that ax+y ...

متن کامل

Reservation-Based Totally Ordered Multicasting

We present an innovative totally ordered multicast protocol that is based on reservation of buffers at the destinations and intermediate network bridges, rather than on an acknowledgment strategy. By introducing timestamps into the packets and by using a buffer reservation retract scheme, our protocol not only produces a global total order of packets but also solves the deadlock and starvation ...

متن کامل

QoS Preserving Totally Ordered Multicast

This paper studies the Quality of Service QoS guarantees of totally ordered multicast algo rithms The paper shows that totally ordered multicast can coexist with guaranteed predictable delays in certain network models The paper considers two reservation models constant bit rate CBR and variable bit rate VBR For these models the paper presents totally ordered multicast algorithms that preserve t...

متن کامل

Logics and Automata for Totally Ordered Trees

A totally ordered tree is a tree equipped with an additional total order on its nodes. It provides a formal model for data that comes with both a hierarchical and a sequential structure; one example for such data are natural language sentences, where a sequential structure is given by word order, and a hierarchical structure is given by grammatical relations between words. In this paper, we stu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Science and Information Systems

سال: 2013

ISSN: 1820-0214

DOI: 10.2298/csis120716045a